Termination of Logic Programs via Labelled Term Rewrite Systems
نویسنده
چکیده
We propose automatically proving termination of logic programs by transforming them into term rewrite systems (TRS). We describe such a transformation for which termination of the logic program follows from innermost termination of the TRS, which is stronger than previous results. Semantic labelling turns out to be a powerful tool for proving termination of this kind of TRSs: we use it to prove termination of the TRS corresponding to any structural recursive logic program, and also for proving termination of implementations of quick-sort and generation of permutations.
منابع مشابه
Proving termination of CHR in Prolog: A transformational approach
In this paper we present a termination preserving transformation from Constraint Handling Rules to Prolog. The transformation is sound w.r.t. termination under the theoretical semantics of Constraint Handling Rules. It does not consider the presence of a propagation history. The transformation allows for the direct reuse of termination proof methods from Logic Programs and Term-Rewrite Systems,...
متن کاملTermination of Logic Programs Using Semantic Unification
We introduce a transformation of well-moded logic programs into constructor systems, a subclass of term rewrite systems, such that left-termination of the logic program follows from termination of the derived constructor system. Thereafter, we present a new technique to prove termination of constructor systems. In the technique semantic uni-cation is used. Thus, surprisingly, semantic uniicatio...
متن کاملA Transformational Methodology for Proving Termination of Logic Programs
A methodology for proving the termination of well-moded logic programs is developed by reducing the termination problem of logic programs to that of term rewriting systems. A transformation procedure is presented to derive a term rewriting system from a given well-moded logic program such that the termination of the derived rewrite system implies the termination of the logic program for all wel...
متن کاملProving Termination of GHC Programs 1
A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that uniications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This appr...
متن کاملTermination of Constructor Systems Using Semantic Uniication Termination of Constructor Systems Using Semantic Uniication Termination of Constructor Systems Using Semantic Uniication
We present a new technique to prove termination of term rewrite systems, or more precise, constructor systems (CSs). In earlier work we introduced a transformation of well-moded logic programs into CSs, such that termination of the logic program follows from termination of the obtained CS. The technique to prove termination of CSs described in this paper is in particular suitable for, but not l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994